Exploiting a Common Property Resource under a Fairness Constraint: a Case Study

نویسندگان

  • Michel Lemaître
  • Gérard Verfaillie
  • Nicolas Bataille
چکیده

Resources co-funded by several agents must be exploited in such a way that three kinds of constraints are met: (1) physical problem (hard) constraints; (2) efficiency constraints, aiming at maximizing the satisfaction of each agent; (3) a fairness constraint, which is ideally satisfied when each agent receives an amount of the resource exactly proportional to its financial contribution. This paper investigates a decision problem for which the common property resource is an earth observation satellite. The problem is to decide on the daily selection of a subset of pictures, among a set of candidate pictures which could be taken the next day considering the satellite trajectory. This subset must satisfy the three kinds of constraints stated above. Although fair division problems have received considerable attention for a long time, especially from microeconomists, this specific problem does not fall entirely within a classical approach. This is because the candidate pictures may be incompatible, and because a picture is only of value to the agent requesting it. As in the general case, efficiency and fairness constraints are antagonistic. We propose three ways for solving this share problem. The first one gives priority to fairness, the second one to efficiency, and the third one computes a set of compromises.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Benefit and Cost Games under Fairness Concerns

Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...

متن کامل

Proportional fair scheduling with superposition coding in a cellular cooperative relay system - Invited paper

Many works have tackled on the problem of throughput and fairness optimization in cellular cooperative relaying systems. Considering firstly a two-user relay broadcast channel, we design a scheme based on Superposition Coding (SC) which maximizes the achievable sum-rate under a Proportional Fairness (PF) constraint. Unlike most relaying schemes where users are allocated orthogonally, our scheme...

متن کامل

The resource-constraint project scheduling problem of the project subcontractors in a cooperative environment: Highway construction case study

Large-scale projects often have several activities which are performed by subcontractors with limited multi-resources. Project scheduling with limited resources is one of the most famous problems in the research operations and optimization cases. The resource-constraint project scheduling problem (RCPSP) is a NP-hard problem in which the activities of a project must be scheduled to reduce the p...

متن کامل

A Local Search Approach to the Resource Constrained Project Scheduling Problem to Minimize Convex Costs

As the resource constrained project scheduling problem (RCPSP) has a wide range of applications, its models, extensions and algorithms have been intensively studied [2]. As for objective functions, makespan minimization has commonly been used, while the importance of non-regular ones such as earliness-tardiness are also recognized. In this paper, we introduce a time-lag cost, which is charged a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999